Search Environments , Representation , and Encoding
نویسندگان
چکیده
This chapter explores the benefi ts of restructuring search spaces and internal representations so as to make search more effi cient. It begins by providing a formal defi nition of search, and proposes a method for shifting search between lowand high-dimensionality problem spaces. Consideration is given to how learning shapes the representations that help people search effi ciently as well as on constraints that people face. Some constraints are considered biases necessary to make sense out of the world; others (e.g., working memory) are taken as both “limiters” to be overcome and “permitters” that make learning in a fi nite amount of time possible at all. Further constraints on search are tied to the physical structure of the world. The chapter concludes with a discussion of social search, where communication can promote exploration and exploitation in an environment that often consists of other agents searching for similar solutions.
منابع مشابه
Adaptive Encoding: How to Render Search Coordinate System Invariant
This paper describes a method for rendering search coordinate system independent, Adaptive Encoding. Adaptive Encoding is applicable to any iterative search algorithm and employs incremental changes of the representation of solutions. One attractive way to change the representation in the continuous domain is derived from Covariance Matrix Adaptation (CMA). In this case, adaptive encoding recov...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملAdaptive Encoding for Optimization
This report describes a general method for rendering search coordinate system independent, Adaptive Encoding (AE). Adaptive Encoding is applicable to any continuous domain search algorithm and includes (incremental) changes of the coordinate system, that is, changes of the representation of solutions. One attractive way to change the representation within AE is derived from the Covariance Matri...
متن کاملA Case for Codons in Evolutionary Algorithms
A new method is developed for representation and encoding in population-based evolutionary algorithms. The method is inspired by the biological genetic code and utilizes a many-to-one, codon-based, genotype-tophenotype translation scheme. A genetic algorithm was implemented with this codon-based representation using three different codon translation tables, each with different characteristics. ...
متن کاملA Chromosome Representation Encoding Intersection Points for Evolutionary Design of Fuzzy Classifiers
Unlike the conventional chromosome representation to search the shape of fuzzy membership functions, a novel encoding scheme to search the optimal intersection points between adjacent fuzzy membership functions is originally presented for evolutionary design of fuzzy classifiers. Since the proposed representation contains the intersection points directly related to the boundary of classificatio...
متن کاملA Flexible Integrated Forward/ Reverse Logistics Model with Random Path-based Memetic Algorithm
Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012